Topological Properties of Some Interconnection Network Graphs
نویسنده
چکیده
Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlying graph models. The vertices of the graph correspond to processors and the edges represent communication links between processors. Parameters such as crossing number and thickness strongly aaect the area required to lay out the corresponding circuit on a VLSI chip. In particular, we give upper bounds for the skewness, crossing number, and thickness of several networks including the mesh of trees, reduced mesh of trees, 2-dimensional torus, butterry, wrapped butterry, and Bene s graph.
منابع مشابه
Linearly many faults in Cayley graphs generated by transposition trees
In the design of parallel computing, the first step is to decide how processors are linked. A static interconnection network has point-to-point communication links among the processors. For example, they can be used for message-passing architectures. The n-cubes were the first major class of interconnection networks. However, they have some deficiencies and [1] provided the class of star graphs...
متن کاملlgorithms of the Hyper - Star Graph and its Related Graphs
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also bee...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملHierarchical Topologies for Large-scale Two-level Networks
We present in this paper some of the topological properties of an interesting class of Circulant graphs whose nodes are labeled by a subset of the Gaussian integers. Such graphs and the problems we solve on them have direct applications to the design of interconnection networks and, in addition, they can be considered in the design of perfect error-correcting codes for two-dimensional signal sp...
متن کاملThe Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of interconnection networks based on IP graphs to achieve desired properties; the results compare favorably with popular interconnection networks, as measured by topological (e.g., node degree and diameter) and algorithmic pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996